641A - Little Artem and Grasshopper - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
int n, input;
string s;
vector<int> jump;
bool vis[100005];
bool bisa = false;

void grasshopper(int x){
	if(x < 0 || x >= n){
		bisa = true;
		return;
	}
	if(vis[x]){
		bisa = false;
		return;
	}
	vis[x] = true;
	if(s[x] == '>'){
		grasshopper(x+jump[x]);
	}
	else{
		grasshopper(x-jump[x]);
	}
}

int main(){
	
	cin >> n;
	cin >> s;
	for(int i = 0; i < n; i++){
		cin >> input;
		jump.push_back(input);
	}
	grasshopper(0);
	if(bisa){
		cout << "FINITE";
	}
	else cout << "INFINITE";
}